Guiding the Search-Based Testing via Dominances vs. Control Dependencies
نویسنده
چکیده
The representation of the problem and the definition of the fitness function are the two key ingredients for the application of search-based optimization to software engineering problems. Therefore, a well-defined fitness function is essential to the effectiveness of search-based testing (SBT). Several search based test-data generation techniques utilized the control dependencies (CD) for guiding the search to find tests. Ghiduk et al. presented a search-based technique that utilizes the dominances to direct the search to generate test data. In this paper, we illustrate the efficiency of dominances in the controlflow graph (CFG) in guiding the SBT. The paper gives some problems for SBT which is guided by the CD. The paper introduces a general form for a fitness function in terms of dominances nodes and postdominances. This function will improve the efficiency of the search consequently; the SBT overcomes the CD problems.
منابع مشابه
Using Dominance for Aiding the Search-Based Testing to Overcome the Limitations of the Control-Dependencies
Search-based optimization techniques have been utilized for a number of software engineering activities. The representation of the problem and the definition of the fitness function (FF) are two key ingredients for the application of search-based optimization to software engineering problems. Therefore, a well-defined fitness function is essential to the effectiveness and efficiency of the sear...
متن کاملOptimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کاملPartial Elements and Recursion via Dominances in Univalent Type Theory
We begin by revisiting partiality in univalent type theory via the notion of dominance. We then perform first steps in constructive computability theory, discussing the consequences of working with computability as property or structure, without assuming countable choice or Markov’s principle. A guiding question is what, if any, notion of partial function allows the proposition “all partial fun...
متن کاملTowards Search Control via Dependency Graphs in Europa2
We develop domain-independent search control for NASA’s Europa2 planning system based on the construction of Dependency Graphs, which succinctly represent the dependencies between the activities of a domain. This approach can be generalized to other temporal planners whose performance also relies on careful engineering of the domains and/or handcoded domain-dependent search control information.
متن کاملA Methodology for Unified Assessment of Physical and Geographical Dependencies of Wide Area Measurement Systems in Smart Grids
Wide Area Measurement Systems (WAMS) enable real time monitoring and control of smart grids by combining digital measurement devices, communication and control systems. As WAMS consist of various infrastructures, they imply complex dependencies among their underlying systems and components of different types, such as cyber, physical and geographical dependencies. Although several works exist in...
متن کامل